Frechet similarity of closed polygonal curves

نویسندگان

  • Michail I. Schlesinger
  • Evgeniy Vodolazskiy
  • V. M. Yakovenko
چکیده

Received (received date) Revised (revised date) Communicated by (Name) The article analyzes similarity of closed polygonal curves with respect to the Fréchet metric, which is stronger than the well-known Hausdorff metric and therefore is more appropriate in some applications. An algorithm is described that determines whether the Fréchet distance between two closed polygonal curves with m and n vertices is less than a given number ε. The algorithm takes O(mn) time whereas the previously known algorithms take O(mn log(mn)) time.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Similarity of closed polygonal curves in Frechet metric

Received (received date) Revised (revised date) Communicated by (Name) The article analyzes similarity of closed polygonal curves in Frechet metric, which is stronger than the well-known Hausdorff metric and therefore is more appropriate in some applications. An algorithm that determines whether the Frechet distance between two closed polygonal curves with m and n vertices is less than a given ...

متن کامل

Applied Similarity Problems Using Frechet Distance

The Fréchet distance is a well-known metric to measure similarity of polygonal curves. In the first part of this thesis, we introduce a new metric called Fréchet distance with speed limits and provide efficient algorithms for computing it. The classical Fréchet distance between two curves corresponds to the maximum distance between two point objects that traverse the curves with arbitrary non-n...

متن کامل

Lower Bounds for the Complexity of the Voronoi Diagram of Polygonal Curves under the Discrete Frechet Distance

We give lower bounds for the combinatorial complexity of the Voronoi diagram of polygonal curves under the discrete Fréchet distance. We show that the Voronoi diagram of n curves in R with k vertices each, has complexity Ω(n) for dimension d = 1, 2 and Ω(nd(k−1)+2) for d > 2.

متن کامل

Polygonal Approximation of Closed Curves across Multiple Views

Polygon approximation is an important step in the recognition of planar shapes. Traditional polygonal approximation algorithms handle only images that are related by a similarity transformation. The transformation of a planar shape as the viewpoint changes with a perspective camera is a general projective one. In this paper, we present a novel method for polygonal approximation of closed curves...

متن کامل

Linear Time Calculation of 2D Shortest Polygonal Jordan Curves

The length of curves may be measured by numeric integration if the curves are given by analytic formulas. Not all curves can or should be described parametrically. In this report we use the alternative grid topology approach. The shortest polygonal Jordan curve in a simple closed one-dimensional grid continuum is used to estimate a curve's length. An O(n) algorithm for finding the shortest poly...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Int. J. Comput. Geometry Appl.

دوره 26  شماره 

صفحات  -

تاریخ انتشار 2016